By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 21, Issue 2, pp. 203-406

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Partitioning Planar Graphs

Thang Nguyen Bui and Andrew Peck

pp. 203-215

BibTeX  Abstract Full Text:  PDF

A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata

Wen-Guey Tzeng

pp. 216-227

BibTeX  Abstract Full Text:  PDF

Subgroup Refinement Algorithms for Root Finding in $GF(q)$

A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone

pp. 228-239

BibTeX  Abstract Full Text:  PDF

Learning Integer Lattices

David Helmbold, Robert Sloan, and Manfred K. Warmuth

pp. 240-266

BibTeX  Abstract Full Text:  PDF

Efficient Point Location in a Convex Spatial Cell-Complex

Franco P. Preparata and Roberto Tamassia

pp. 267-280

BibTeX  Abstract Full Text:  PDF

A Heuristic of Scheduling Parallel Tasks and Its Analysis

Qingzhou Wang and Kam-Hoi Cheng

pp. 281-294

BibTeX  Abstract Full Text:  PDF

Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs

Pang C. Chen

pp. 295-315

BibTeX  Abstract Full Text:  PDF

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy

Seinosuke Toda and Mitsunori Ogiwara

pp. 316-328

BibTeX  Abstract Full Text:  PDF

Lower Bounds for Threshold and Symmetric Functions in Parallel Computation

Yossi Azar

pp. 329-338

BibTeX  Abstract Full Text:  PDF

Convex Decomposition of Polyhedra and Robustness

Chanderjit L. Bajaj and Tamal K. Dey

pp. 339-364

BibTeX  Abstract Full Text:  PDF

Fast Gossiping for the Hypercube

David W. Krumme

pp. 365-380

BibTeX  Abstract Full Text:  PDF

Recognizing $P_4 $-Sparse Graphs in Linear Time

Beverly Jamison and Stephan Olariu

pp. 381-406

BibTeX  Abstract Full Text:  PDF